/**
 * Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array 
 * such that nums[i] = nums[j] and the difference between i and j is at most k.
 */
/**
 * @author I321035
 *
 */
package problem219_Contains_Duplicate_II;